The Overview of Harmony Search
ثبت نشده
چکیده
When musicians compose the harmony, they usually try various possible combinations of the music pitches stored in their memory, which can be considered as a optimization process of adjusting the input (pitches) to obtain the optimal output (perfect harmony). Harmony search draws the inspiration from harmony improvisation, and has gained considerable results in the field of optimization, although it is a relatively NIC algorithm. With mimicking the rules of various combining pitches, harmony search has two distinguishing operators different from other NIC algorithms: harmony memory considering rate (HMCR) and pitch adjusting rate (PAR) that are used to generate and further mutate a solution, respectively. This candidate generation mechanism and single search memory involved decide its excellence in structure simplicity and small initial population. This chapter presents the discussions of the inspiration of harmony search, the basic harmony search optimization algorithm, and an overview of different application areas of the harmony search.
منابع مشابه
SHAPE OPTIMIZATION OF STRUCTURES BY MODIFIED HARMONY SEARCH
The main aim of the present study is to propose a modified harmony search (MHS) algorithm for size and shape optimization of structures. The standard harmony search (HS) algorithm is conceptualized using the musical process of searching for a perfect state of the harmony. It uses a stochastic random search instead of a gradient search. The proposed MHS algorithm is designed based on elitism. In...
متن کاملIntelligent Tuned Harmony Search for Solving Economic Dispatch Problem with Valve-point Effects and Prohibited Operating Zones
Economic dispatch with valve point effect and Prohibited Operating Zones (POZs) is a non-convex and discontinuous optimization problem. Harmony Search (HS) is one of the recently presented meta-heuristic algorithms for solving optimization problems, which has different variants. The performances of these variants are severely affected by selection of different parameters of the algorithm. Intel...
متن کاملIIR System Identification Using Improved Harmony Search Algorithm with Chaos
Due to the fact that the error surface of adaptive infinite impulse response (IIR) systems is generally nonlinear and multimodal, the conventional derivative based techniques fail when used in adaptive identification of such systems. In this case, global optimization techniques are required in order to avoid the local minima. Harmony search (HS), a musical inspired metaheuristic, is a recently ...
متن کاملNew Formulation and Solution in PCB Assembly Systems with Parallel Batch processors
This paper considers the scheduling problem of parallel batch processing machines with non-identical job size and processing time. In this paper, a new mathematical model with ready time and batch size constraints is presented to formulate the problem mathematically, in which simultaneous reduction of the makespan and earliness-tardiness is the objective function. In recent years, the nature-in...
متن کاملOptimum Design of Scallop Domes for Dynamic Time History Loading by Harmony Search-Firefly Algorithm
This paper presents an efficient meta-heuristic algorithm for optimization of double-layer scallop domes subjected to earthquake loading. The optimization is performed by a combination of harmony search (HS) and firefly algorithm (FA). This new algorithm is called harmony search firefly algorithm (HSFA). The optimization task is achieved by taking into account geometrical and material nonlinear...
متن کامل